Mathematical problem - PDFSEARCH.IO - Document Search Engine

Mathematical problem
Results: 2693

#	Item
541	Three Dimensional Bin Packing Problem with Variable Bin Height Yong Wu a,b,∗ , Wenkai Li b , Mark Goh b,c , Robert de Souza b a Institute b The Add to Reading List Source URL: www98.griffith.edu.au Language: English - Date: 2011-05-11 13:37:50 Packaging Operations research Discrete geometry Bin packing problem Mathematical optimization Computational complexity theory Packing problem Carton Bounded-error probabilistic polynomial Theoretical computer science Mathematics Applied mathematics
542	Paradox Issue 2, 2003 The Magazine of the Melbourne University Mathematics and Statistics Society Joe Healy Add to Reading List Source URL: www.ms.unimelb.edu.au Language: English - Date: 2011-11-19 03:23:12 Complexity classes Mathematical optimization W. B. R. Lickorish P versus NP problem Travelling salesman problem Time complexity NP Knot theory P Theoretical computer science Computational complexity theory Applied mathematics
543	CCCG 2009, Vancouver, BC, August 17–19, 2009 Generalized jewels and the point placement problem Md. Shafiul Alam∗ Asish Mukhopadhyay* Add to Reading List Source URL: cccg.ca Language: English - Date: 2009-09-02 14:20:13 Mathematical analysis Mathematics Dimension Projective geometry Higman–Sims graph Analytic geometry Group theory Asymptote
544	Mathematical Entertainments This column is a place for those bits of contagious mathnnatics lhat travel from person to person in the community, because they are so Add to Reading List Source URL: www.cl.cam.ac.uk Language: English - Date: 2015-02-19 08:49:39 Locker Office equipment Changing room Strategy Probability Problem solving Technology Visual arts Game theory Cabinets Furniture
545	JOURNAL OF MATHEMATICAL PHYSICS 51, 043302 共2010兲 Spherical codes, maximal local packing density, and the golden ratio Adam B. Hopkins,1 Frank H. Stillinger,1 and Salvatore Torquato1,2,3,4,a兲 1 Add to Reading List Source URL: cherrypit.princeton.edu Language: English - Date: 2010-04-13 12:20:17 Spheres Crystallography Elementary geometry Packaging Packing problem Sphere packing Sphere Kissing number problem N-sphere Geometry Mathematics Discrete geometry
546	On Two Class-Constrained Versions of the Multiple Knapsack Problem ∗ Hadas Shachnai † Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-04-15 10:32:13 Operations research Combinatorial optimization NP-complete problems Mathematical optimization Dynamic programming Knapsack problem Job shop scheduling Optimization problem Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
547	Appendix B The Magic of Iteration The subject of this appendix is one of our favorites in all of mathematics, and it’s not hard to explain why. As you will see, the basic theorem, the Banach Contraction Principle, has Add to Reading List Source URL: vmm.math.uci.edu Language: English - Date: 2010-07-07 15:30:49 Topology Lipschitz continuity Fixed points Banach fixed-point theorem Contraction mapping Inverse function theorem Metric space Contraction principle Initial value problem Mathematical analysis Mathematics Metric geometry
548	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap Hamidreza Chitsaz∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:09:09 Theoretical computer science Mathematical optimization Operations research Network theory Motion planning Shortest path problem Dynamic programming Algorithm Visibility graph Mathematics Applied mathematics Graph theory
549	Decomposition in Integer Linear Programming T.K. Ralphs∗ M.V. Galati† Revised August 16, 2005 Add to Reading List Source URL: coral.ie.lehigh.edu Language: English - Date: 2010-06-19 14:25:51 Operations research Combinatorial optimization Linear programming Convex optimization Linear programming relaxation Cutting-plane method Travelling salesman problem Relaxation Optimization problem Mathematical optimization Theoretical computer science Mathematics
550	informs MATHEMATICS OF OPERATIONS RESEARCH Vol. 00, No. 0, Xxxxxx 20xx, pp. xxx–xxx ISSN 0364-765X \| EISSN \|xx\|0000\|0xxx Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-09-10 09:13:15 Operations research Submodular set function Computational complexity theory Linear programming Randomized rounding Continuous function Optimization problem Mathematical optimization Time complexity Theoretical computer science Mathematics Applied mathematics

UPDATE